Back to course home
0% completed
Vote For New Content
Introduction
Course Overview
Basics of Tree
Introduction to Tree
Types of Tree
BST Traversal Techniques
BST Operations
Level Order Traversal Pattern (easy)
Introduction to Level Order Traversal Pattern
Reverse Level Order Traversal (easy)
Solution: Reverse Level Order Traversal
Find Largest Value in Each Tree Row (medium)
Solution: Find Largest Value in Each Tree Row
Maximum Width of Binary Tree (medium)
Solution: Maximum Width of Binary Tree
Maximum Level Sum of a Binary Tree (medium)
Solution: Maximum Level Sum of a Binary Tree
Zigzag Traversal (medium)
Solution: Zigzag Traversal
Even Odd Tree (medium)
Solution: Even Odd Tree
N-ary Tree Level Order Traversal (hard)
Solution: N-ary Tree Level Order Traversal
Tree Depth Pattern (easy)
Introduction to Tree Depth Pattern
Maximum Depth (or Height) of Binary Tree (easy)
Solution: Maximum Depth (or Height) of Binary Tree
Minimum Depth of a Binary Tree (easy)
Solution: Minimum Depth of a Binary Tree
Balanced Binary Tree (easy)
Solution: Balanced Binary Tree
Tree Diameter (easy)
Solution: Tree Diameter
Maximum Depth of N-ary Tree (easy)
Solution: Maximum Depth of N-ary Tree
Find maximum depth of subtree (medium)
Solution: Find maximum depth of subtree
Serialize and Deserialize Tree Pattern (hard)
Introduction to Serialize and Deserialize Tree Pattern
Serialize and Deserialize BST (medium)
Solution: Serialize and Deserialize BST
Verify Preorder Serialization of a Binary Tree (medium)
Solution: Verify Preorder Serialization of a Binary Tree
Create Binary Tree From Descriptions (medium)
Solution: Create Binary Tree From Descriptions
Serialize and Deserialize N-ary Tree (hard)
Solution: Serialize and Deserialize N-ary Tree
Subtree of Another Tree (easy)
Problem Statement
Given the roots of two binary trees, root and subRoot, return true if subRoot is a subtree of root. Otherwise, return false.
A subtree of a binary tree is a part of the tree that includes a node and all of its descendants. The tree tree could also be considered as a subtree of itself.
Examples
Example 1
- Input: root =
[3, 6, 5, 1, 4], subRoot =[6, 1, 4]
- Expected Output:
true - Explanation: The subtree starting at node 6 in
roothas the same structure and values assubRoot.
Example 2
- Input: root =
[3, 4, 5, null, 2, null, 1], subRoot =[4, null, 2]
- Expected Output:
true - Explanation: The subtree rooted at node 4 in
rootmatches the structure and values ofsubRoot.
Example 3
- Input: root =
[3, 4, 5, 1, 2, null, null, 0], subRoot =[4, 1, 2]
- Expected Output:
false - Explanation: While node 4 exists in
root, its subtree structure is different because of the extra node0.
Constraints:
- The number of nodes in the root tree is in the range [1, 2000].
- The number of nodes in the subRoot tree is in the range [1, 1000].
- -104 <= root.val <= 104
- -104 <= subRoot.val <= 104
Try it yourself
Try solving this question here:
Java
. . . .
Solution: Mirror Image Trees
Solution: Subtree of Another Tree
Mark as Completed
On this page
Problem Statement
Examples
Try it yourself